Verification of Fault Tolerance and Real Time
نویسندگان
چکیده
A transformational method is given for specifying and verifying fault-tolerant, real-time programs. Such a program needs to be provably correct according to both its functional and real-time requirements, despite the possible occurrence of system failures. The paper demonstrates that a suitably expressive logic for real-time systems makes it possible to naturally model the state changes caused by system failures and determine their effect on the functional and real-time properties of executions.
منابع مشابه
Runtime Verification for Ultra-Critical Systems
Runtime verification (RV) is a natural fit for ultra-critical systems, where correctness is imperative. In ultra-critical systems, even if the software is fault-free, because of the inherent unreliability of commodity hardware and the adversity of operational environments, processing units (and their hosted software) are replicated, and fault-tolerant algorithms are used to compare the outputs....
متن کاملMaking real-time systems fault tolerant: a specification-based approach
To make an event-triggered real-time system safe in application layer, this study presents a specification-based run-time verification (RV) and fault tolerance approach in following steps: i) System is isolated from its environment by modeling interaction between them; ii) Considering safety requirements violation, observation-verification-tolerance rules are systematically obtained; and iii) R...
متن کاملCompositional Verification of Real-Time Fault-Tolerant Programs
A hard-masking real-time program is one that satisfies safety (including timing constraints) and liveness properties in the absence and presence of faults. It has been shown that any hard-masking program can be decomposed into a faultintolerant version and a set of fault-tolerance components known as detectors and δ-correctors. In this paper, we introduce a set of sufficient conditions for inte...
متن کاملModeling and Verification of a Fault-Tolerant Real-Time Startup Protocol Using Calendar Automata
We discuss the modeling and verification of real-time systems using the SAL model checker. A new modeling framework based on event calendars enables dense timed systems to be described without relying on continuously varying clocks. We present verification techniques that rely on induction and abstraction, and show how these techniques are efficiently supported by the SAL symbolic model-checkin...
متن کاملDesign and Verification of Fault-Tolerant Components
We present a systematic approach to design and verification of faulttolerant components with real-time properties as found in embedded systems. A state machine model of the correct component is augmented with internal transitions that represent hypothesized faults. Also, constraints on the occurrence or timing of faults are included in this model. This model of a faulty component is then extend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996